22

New bounds on the edge number of a k-map graph

Year:
2007
Language:
english
File:
PDF, 310 KB
english, 2007
24

Efficient Approximation Schemes for Maximization Problems onK3, 3-free orK5-free Graphs

Year:
1998
Language:
english
File:
PDF, 263 KB
english, 1998
25

Approximation Algorithms for Independent Sets in Map Graphs

Year:
2001
Language:
english
File:
PDF, 172 KB
english, 2001
26

A randomized NC algorithm for the maximal tree cover problem

Year:
1991
Language:
english
File:
PDF, 769 KB
english, 1991
27

A parallel algorithm for finding a triconnected component separator with an application

Year:
1994
Language:
english
File:
PDF, 591 KB
english, 1994
28

A fast and efficient NC algorithm for maximal matching

Year:
1995
Language:
english
File:
PDF, 415 KB
english, 1995
29

Parallel complexity of partitioning a planar graph into vertex-induced forests

Year:
1996
Language:
english
File:
PDF, 1.06 MB
english, 1996
30

Parallel constructions of maximal path sets and applications to short superstrings

Year:
1996
Language:
english
File:
PDF, 1.50 MB
english, 1996
32

Approximating maximum edge 2-coloring in simple graphs

Year:
2010
Language:
english
File:
PDF, 390 KB
english, 2010
33

Improved deterministic approximation algorithms for Max TSP

Year:
2005
Language:
english
File:
PDF, 148 KB
english, 2005
34

Computing bounded-degree phylogenetic roots of disconnected graphs

Year:
2006
Language:
english
File:
PDF, 221 KB
english, 2006
38

Computing phylogenetic roots with bounded degrees and errors is NP-complete

Year:
2006
Language:
english
File:
PDF, 353 KB
english, 2006
39

Preface

Year:
2007
Language:
english
File:
PDF, 114 KB
english, 2007
46

Fast RNC and NC algorithms for maximal path sets

Year:
1999
Language:
english
File:
PDF, 659 KB
english, 1999
47

Efficient algorithms for acyclic colorings of graphs

Year:
2000
Language:
english
File:
PDF, 209 KB
english, 2000